The Power (Law) of Indian Markets: Analysing NSE and BSE trading statistics

The nature of fluctuations in the Indian financial market is analyzed in this paper. We have looked at the price returns of individual stocks, with tick-by-tick data from the National Stock Exchange (NSE) and daily closing price data from both NSE and the Bombay Stock Exchange (BSE), the two largest exchanges in India. We find that the price returns in Indian markets follow a fat-tailed cumulative distribution, consistent with a power law having exponent $\alpha \sim 3$, similar to that observed in developed markets. However, the distributions of trading volume and the number of trades have a different nature than that seen in the New York Stock Exchange (NYSE). Further, the price movement of different stocks are highly correlated in Indian markets.Comment: 10 pages, 7 figures, to appear in Proceedings of International Workshop on "Econophysics of Stock Markets and Minority Games" (Econophys-Kolkata II), Feb 14-17, 200

Scaling exponents and clustering coefficients of a growing random network

The statistical property of a growing scale-free network is studied based on an earlier model proposed by Krapivsky, Rodgers, and Redner [Phys. Rev. Lett. 86, 5401 (2001)], with the additional constraints of forbidden of self-connection and multiple links of the same direction between any two nodes. Scaling exponents in the range of 1-2 are obtained through Monte Carlo simulations and various clustering coefficients are calculated, one of which, $C_{\rm out}$, is of order $10^{-1}$, indicating the network resembles a small-world. The out-degree distribution has an exponential cut-off for large out-degree.Comment: six pages, including 5 figures, RevTex 4 forma

Path finding strategies in scale-free networks

We numerically investigate the scale-free network model of Barab{\'a}si and Albert [A. L. Barab{\'a}si and R. Albert, Science {\bf 286}, 509 (1999)] through the use of various path finding strategies. In real networks, global network information is not accessible to each vertex, and the actual path connecting two vertices can sometimes be much longer than the shortest one. A generalized diameter depending on the actual path finding strategy is introduced, and a simple strategy, which utilizes only local information on the connectivity, is suggested and shown to yield small-world behavior: the diameter $D$ of the network increases logarithmically with the network size $N$, the same as is found with global strategy. If paths are sought at random, $D \sim N^{0.5}$ is found.Comment: 4 pages, final for

World-Wide Web scaling exponent from Simon's 1955 model

Recently, statistical properties of the World-Wide Web have attracted considerable attention when self-similar regimes have been observed in the scaling of its link structure. Here we recall a classical model for general scaling phenomena and argue that it offers an explanation for the World-Wide Web's scaling exponent when combined with a recent measurement of internet growth.Comment: 1 page RevTeX, no figure

We are the Change that we Seek: Information Interactions During a Change of Viewpoint

There has been considerable hype about filter bubbles and echo chambers influencing the views of information consumers. The fear is that these technologies are undermining democracy by swaying opinion and creating an uninformed, polarised populace. The literature in this space is mostly techno-centric, addressing the impact of technology. In contrast, our work is the first research in the information interaction field to examine changing viewpoints from a human-centric perspective. It provides a new understanding of view change and how we might support informed, autonomous view change behaviour. We interviewed 18 participants about a self-identified change of view, and the information touchpoints they engaged with along the way. In this paper we present the information types and sources that informed changes of viewpoint, and the ways in which our participants interacted with that information. We describe our findings in the context of the techno-centric literature and suggest principles for designing digital information environments that support user autonomy and reflection in viewpoint formation

Giant Clusters in Random Ad Hoc Networks

The present paper introduces ad hoc communication networks as examples of large scale real networks that can be prospected by statistical means. A description of giant cluster formation based on the single parameter of node neighbor numbers is given along with the discussion of some asymptotic aspects of the giant cluster sizes.Comment: 6 pages, 5 figures; typos and correction

Highly clustered scale-free networks

We propose a model for growing networks based on a finite memory of the nodes. The model shows stylized features of real-world networks: power law distribution of degree, linear preferential attachment of new links and a negative correlation between the age of a node and its link attachment rate. Notably, the degree distribution is conserved even though only the most recently grown part of the network is considered. This feature is relevant because real-world networks truncated in the same way exhibit a power-law distribution in the degree. As the network grows, the clustering reaches an asymptotic value larger than for regular lattices of the same average connectivity. These high-clustering scale-free networks indicate that memory effects could be crucial for a correct description of the dynamics of growing networks.Comment: 6 pages, 4 figure

Large-scale structural organization of social networks

The characterization of large-scale structural organization of social networks is an important interdisciplinary problem. We show, by using scaling analysis and numerical computation, that the following factors are relevant for models of social networks: the correlation between friendship ties among people and the position of their social groups, as well as the correlation between the positions of different social groups to which a person belongs.Comment: 5 pages, 3 figures, Revte

Neuropsychological constraints to human data production on a global scale

Which are the factors underlying human information production on a global level? In order to gain an insight into this question we study a corpus of 252-633 Million publicly available data files on the Internet corresponding to an overall storage volume of 284-675 Terabytes. Analyzing the file size distribution for several distinct data types we find indications that the neuropsychological capacity of the human brain to process and record information may constitute the dominant limiting factor for the overall growth of globally stored information, with real-world economic constraints having only a negligible influence. This supposition draws support from the observation that the files size distributions follow a power law for data without a time component, like images, and a log-normal distribution for multimedia files, for which time is a defining qualia.Comment: to be published in: European Physical Journal

Generic scale of the "scale-free" growing networks

We show that the connectivity distributions $P(k,t)$ of scale-free growing networks ($t$ is the network size) have the generic scale -- the cut-off at $k_{cut} \sim t^\beta$. The scaling exponent $\beta$ is related to the exponent $\gamma$ of the connectivity distribution, $\beta=1/(\gamma-1)$. We propose the simplest model of scale-free growing networks and obtain the exact form of its connectivity distribution for any size of the network. We demonstrate that the trace of the initial conditions -- a hump at $k_h \sim k_{cut} \sim t^\beta$ -- may be found for any network size. We also show that there exists a natural boundary for the observation of the scale-free networks and explain why so few scale-free networks are observed in Nature.Comment: 4 pages revtex, 3 figure